Logics for Approximate Entailment in ordered universes of discourse

نویسندگان

  • Thomas Vetterlein
  • Francesc Esteva
  • Lluis Godo
چکیده

The Logic of Approximate Entailment (LAE) is a graded counterpart of classical propositional calculus, where conclusions that are only approximately correct can be drawn. This is achieved by equipping the underlying set of possible worlds with a similarity relation. When using this logic in applications, however, a disadvantage must be accepted; namely, in LAE it is not possible to combine conclusions in a conjunctive way. In order to overcome this drawback, we propose in this paper a modification of LAE where, at the semantic level, the underlying set of worlds is moreover endowed with an order structure. The chosen framework is designed in view of possible applications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logics for approximate entailment in ordered universes of discourse

The Logic of Approximate Entailment (LAE) is a graded counterpart of classical propositional calculus, where conclusions that are only approximately correct can be drawn. This is achieved by equipping the underlying set of possible worlds with a similarity relation. When using this logic in applications, however, a disadvantage must be accepted; namely, in LAE it is not possible to combine conc...

متن کامل

Logics for approximate entailment in ordered universes of discourse

The Logic of Approximate Entailment (LAE) is a graded counterpart of classical propositional calculus, where conclusions that are only approximately correct can be drawn. This is achieved by equipping the underlying set of possible worlds with a similarity relation. When using this logic in applications, however, a disadvantage must be accepted; namely, in LAE it is not possible to combine conc...

متن کامل

Mechanisms for Combining Logics

We consider three paradigmatic combination mechanisms for propo-sitional based logics: synchronization, bring and parameterization. We introduce our working universes of logic systems and recall their original characterizations, both model and proof-theoretically. We present a novel notion of algebraic logic system presentation where, besides the usual global of entailment, also local entailmen...

متن کامل

Logics for approximate and strong entailments

We consider two kinds of similarity-based reasoning and formalise them in a logical setting. In one case, we are led by the principle that conclusions can be drawn even if they are only approximately correct. This leads to a graded approximate entailment, which is weaker than classical entailment. In the other case, we follow the principle that conclusions must remain correct even if the assump...

متن کامل

Semantic Preferential Subsumption

We present a general preferential semantic framework for plausible subsumption in description logics, analogous to the KLM preferential semantics for propositional entailment. We introduce the notion of ordered interpretations for description logics, and use it to define two mutually dual non-deductive subsumption relations

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Approx. Reasoning

دوره 71  شماره 

صفحات  -

تاریخ انتشار 2016